Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("05C65")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 209

  • Page / 9
Export

Selection :

  • and

Cost colourings of hypergraphsDRGAS-BURCHARDT, Ewa; FIEDOROWICZ, Anna.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1298-1305, issn 0012-365X, 8 p.Conference Paper

AN EXACT RESULT FOR HYPERGRAPHS AND UPPER BOUNDS FOR THE TURÁN DENSITY OF Krr+1LINYUAN LU; YI ZHAO.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 3, pp 1324-1334, issn 0895-4801, 11 p.Article

ON PERFECT MATCHINGS IN UNIFORM HYPERGRAPHS WITH LARGE MINIMUM VERTEX DEGREEHAN, Hiêp; PERSON, Yury; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 732-748, issn 0895-4801, 17 p.Article

STABLE KNESER HYPERGRAPHS AND IDEALS IN N WITH THE NIKODYM PROPERTYALON, Noga; DREWNOWSKI, Lech; LUCZAK, Tomasz et al.Proceedings of the American Mathematical Society. 2009, Vol 137, Num 2, pp 467-471, issn 0002-9939, 5 p.Article

RAMSEY PROPERTIES OF RANDOM k-PARTITE, k-UNIFORM HYPERGRAPHSRÖDL, Vojtech; RUCINSKI, Andrzej; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 2, pp 442-460, issn 0895-4801, 19 p.Article

A characterization of hypercactiSONNTAG, Martin.Discrete mathematics. 2007, Vol 307, Num 21, pp 2615-2621, issn 0012-365X, 7 p.Article

ON 3-HYPERGRAPHS WITH FORBIDDEN 4-VERTEX CONFIGURATIONSRAZBOROV, Alexander A.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 946-963, issn 0895-4801, 18 p.Article

ON COMPUTING THE FREQUENCIES OF INDUCED SUBHYPERGRAPHSNAGLE, Brendan.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 322-329, issn 0895-4801, 8 p.Article

Economical tight examples for the biased Erdös-Selfridge theoremSUNDBERG, Eric.Discrete mathematics. 2008, Vol 308, Num 15, pp 3308-3314, issn 0012-365X, 7 p.Article

Complete r-partite subgraphs of dense r-graphsNIKIFOROV, Vladimir.Discrete mathematics. 2009, Vol 309, Num 13, pp 4326-4331, issn 0012-365X, 6 p.Article

On Chooser-Picker positional gamesCSERNENSZKY, Andras; IVETT MANDITY, C; PLUHAR, Andras et al.Discrete mathematics. 2009, Vol 309, Num 16, pp 5141-5146, issn 0012-365X, 6 p.Article

The Erdos-Faber-Lovasz conjecture for dense hypergraphsSANCHEZ-ARROYO, Abdon.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 991-992, issn 0012-365X, 2 p.Conference Paper

Bonferroni-type inequalities and binomially bounded functionsDOHMEN, K; TITTMANN, P.Discrete mathematics. 2010, Vol 310, Num 6-7, pp 1265-1268, issn 0012-365X, 4 p.Article

HEREDITARY DISCREPANCIES IN DIFFERENT NUMBERS OF COLORS IIDOERR, Benjamin; FOUZ, Mahmoud.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1205-1213, issn 0895-4801, 9 p.Article

Large monochromatic components in colorings of complete 3-uniform hypergraphsGYARFAS, Andras; HAXELL, Penny.Discrete mathematics. 2009, Vol 309, Num 10, pp 3156-3160, issn 0012-365X, 5 p.Article

AN ALGORITHMIC VERSION OF THE HYPERGRAPH REGULARITY METHODHAXELL, P. E; NAGLE, B; RÖDL, V et al.SIAM journal on computing (Print). 2008, Vol 37, Num 6, pp 1728-1776, issn 0097-5397, 49 p.Article

EXTENSION PRESERVATION THEOREMS ON CLASSES OF ACYCLIC FINITE STRUCTURESDURIS, David.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3670-3681, issn 0097-5397, 12 p.Article

EVERY MONOTONE 3-GRAPH PROPERTY IS TESTABLEAVART, Christian; RÖDL, Vojtech; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 1, pp 73-92, issn 0895-4801, 20 p.Article

PARTITIONING SPARSE MATRICES FOR PARALLEL PRECONDITIONED ITERATIVE METHODSUCAR, Bora; AYKANAT, Cevdet.SIAM journal on scientific computing (Print). 2008, Vol 29, Num 4, pp 1683-1709, issn 1064-8275, 27 p.Article

Small maximally disjoint union-free familiesDUKES, Peter; HOWARD, Lea.Discrete mathematics. 2008, Vol 308, Num 18, pp 4272-4275, issn 0012-365X, 4 p.Article

Note on the 3-graph counting lemmaNAGLE, Brendan; RÖDL, Vojtech; SCHACHT, Mathias et al.Discrete mathematics. 2008, Vol 308, Num 19, pp 4501-4517, issn 0012-365X, 17 p.Conference Paper

Simple 8-(31,12,3080), 8-(40,12,16200) and 8-(40,12,16520) designs from PSL(3, 5) and PSL(4, 3)LAUE, Reinhard; WASSERMANN, Alfred.Discrete mathematics. 2008, Vol 308, Num 2-3, pp 166-174, issn 0012-365X, 9 p.Conference Paper

MINIMUM TRANSVERSALS IN POSIMODULAR SYSTEMSSAKASHITA, Mariko; MAKINO, Kazuhisa; NAGAMOCHI, Hiroshi et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 858-871, issn 0895-4801, 14 p.Article

SPLIT HYPERGRAPHSTIMAR, Adam.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 3, pp 1155-1163, issn 0895-4801, 9 p.Article

Revisiting Hypergraph Models for Sparse Matrix PartitioningUCAR, Bora; AYKANAT, Cevdet.SIAM review (Print). 2007, Vol 49, Num 4, pp 595-603, issn 0036-1445, 9 p.Article

  • Page / 9